logical depth造句

Bennett, at IBM, has developed a different measure of complexity that he calls " logical depth ."
Both the logical depth and logical width can be bounded in terms of the treewidth of the given graph.
The sentence outlined above nests the quantifiers for all of its variables, so it has logical depth " n " + 1.
In particular the " logical depth " of a graph is defined to be the minimum level of nesting of quantifiers ( the quantifier rank ) in a sentence defining the graph.
It's difficult to find logical depth in a sentence. 用logical depth造句挺难的